Minimal invariant sets in a vertex-weighted graph
نویسندگان
چکیده
منابع مشابه
Minimal invariant sets in a vertex-weighted graph
A weighting of vertices of a graph is admissible if there exists an edge weighting such that the weight of each vertex equals the sum of weights of its incident edges. Given an admissible vertex weighting of a graph, an invariant set is an edge set such that the sum of the weights of its edges is the same for every edge weighting, and a nonempty invariant set is minimal if none of its nonempty ...
متن کاملWeighted Geodetic Convex Sets in A Graph
Let tt : (V, E, W ) be a finite, connected, weighted graph without loops and multiple edges. In a weighted graph each arc is assigned a weight by the weight function W : E +. A u v path P in tt is called a weighted u v geodesic if the weighted distance between u and v is calculated along P . The strength of a path is the minimum weight of its arcs, and length of a path is the number of edges in...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملcounterexamples in a−minimal sets
several tables have been given due to a − minimal sets. our main aim in this paper is tocomplete these tables by employing several examples.
متن کاملOn invariant sets topology
In this paper, we introduce and study a new topology related to a self mapping on a nonempty set.Let X be a nonempty set and let f be a self mapping on X. Then the set of all invariant subsets ofX related to f, i.e. f := fA X : f(A) Ag P(X) is a topology on X. Among other things,we nd the smallest open sets contains a point x 2 X. Moreover, we find the relations between fand To f . For insta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.06.005